https://nova.newcastle.edu.au/vital/access/ /manager/Index en-au 5 https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:42524 Wed 24 Aug 2022 12:41:23 AEST ]]> https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:42523 Wed 24 Aug 2022 12:27:38 AEST ]]> https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:43828 Tue 04 Oct 2022 11:18:28 AEDT ]]> https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:43530 =4 is even more challenging. Inspired by the success of automated algorithm configuration and automated algorithm selection in solving combinatorial optimization problems, in this paper, we investigate the efficacy of automated algorithm configuration and automated algorithm selection for the CCAG problem, and propose a novel, automated CCAG approach called AutoCCAG. Extensive experiments on public benchmarks show that AutoCCAG can find much smaller-sized CCAs than current state-of-the-art approaches, indicating the effectiveness of AutoCCAG. More encouragingly, to our best knowledge, our paper reports the first results for CCAG with a high coverage strength (i.e., 5-way CCAG) on public benchmarks. Our results demonstrate that AutoCCAG can bring considerable benefits in testing highly configurable software systems.]]> Mon 20 Nov 2023 14:26:03 AEDT ]]> https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:54951 Fri 22 Mar 2024 15:29:12 AEDT ]]> https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:42143 Fri 19 Aug 2022 13:39:06 AEST ]]>